TILES AND IDENTITY BY PATTERN CLASSIFICATION
نویسندگان
چکیده
منابع مشابه
Pattern classification by convex analysis
A useful discriminant vector for pattern classification is one that maximizes the minimum separation of discriminant function values for two pattern classes. This optimality criterion can prove valuable in many situations because it emphasizes the class elements that are most difficult to classify. A method for computing this discriminant vector by quadratic programming is derived. The resultin...
متن کاملClassification of Integral Expanding Matrices and Self-Affine Tiles
Let T be a self-affine tile that is generated by an expanding integral matrix A and a digit set D. It is known that many properties of T are invariant under the Z-similarity of the matrix A. In [LW1] Lagarias and Wang showed that if A is a 2 × 2 expanding matrix with |det(A)| = 2, then the Z-similar class is uniquely determined by the characteristic polynomial of A. This is not true if |det(A)|...
متن کاملDNA Tiles, Wang Tiles and Combinators
In this paper we explore the relation between Wang Tiles and Schonfinkel Combinators in order to investigate Functional Combinators as an programming language for Self-assembly and DNA computing. We show: How any combinatorial program can be expressed in terms of Wang Tiles, and again, how any computation of the program fits into a grid of tiles of a suitable finite, tile set, and finally, how ...
متن کاملMatching of Catalogues by Probabilistic Pattern Classification
We consider the statistical problem of catalogue matching from a machine learning perspective with the goal of producing probabilistic outputs, and using all available information. A framework is provided that unifies two existing approaches to producing probabilistic outputs in the literature, one based on combining distribution estimates and the other based on combining probabilistic classifi...
متن کاملClassification by Pattern-Based Hierarchical Clustering
In this paper, we propose CPHC, a semi-supervised classification algorithm that uses a pattern-based cluster hierarchy as a direct means for classification. All training and test instances are first clustered together using an instance-driven pattern-based hierarchical clustering algorithm that allows each instance to "vote" for its representative size-2 patterns in a way that balances local pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ARTis ON
سال: 2018
ISSN: 2183-7082
DOI: 10.37935/aion.v0i8.218